The Euclid Statistical Matrix Tool

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Euclid Abstract Machine

Concrete non-computable functions are usually related to the halting function. Is it possible to present examples of non-computability, which are unrelated to the halting problem and its derivatives? We built an abstract machine based on the historic concept of compass and ruler constructions (a compass construction would suffice) which reveals the existence of non-computable functions not rela...

متن کامل

Computational Euclid

We analyse the axioms of Euclidean geometry according to standard object-oriented software development methodology. We find a perfect match: the main undefined concepts of the axioms translate to object classes. The result is a suite of C++ classes that efficiently supports the construction of complex geometric configurations. Although all computations are performed in floating-point arithmetic...

متن کامل

The Mixed Binary Euclid Algorithm

We present a new GCD algorithm for two integers that combines both the Euclidean and the binary gcd approaches. We give its worst case time analysis and prove that its bit-time complexity is still O(n) for two n-bit integers. However, our preliminar experiments show that it is very fast for small integers. A parallel version of this algorithm matches the best presently known time complexity, na...

متن کامل

The game of 3-Euclid

In this paper we study 3-Euclid, a modification of the game Euclid to three dimensions. In 3-Euclid, a position is a triplet of positive integers, written as (a, b, c). A legal move is to replace the current position with one in which any integer has been reduced by an integral multiple of some other integer. The only restriction on this subtraction is that the result must stay positive.We solv...

متن کامل

The Primes that Euclid Forgot

j=1 q j . Mullin suggested studying the two sequences formed by (1) always taking q k+1 as small as possible, and (2) always taking q k+1 as large as possible. For each of these sequences, he asked whether every prime eventually appears. Recently, Booker showed that the second sequence omits infinitely many primes. We give a completely elementary proof of Booker’s result, suitable for presentat...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Central Asian Journal of Global Health

سال: 2017

ISSN: 2166-7403

DOI: 10.5195/cajgh.2017.283